Hybrid Atomicity for Nested Transactions
نویسندگان
چکیده
Abst rac t . This paper defines the notion of hybrid atomicityfor nested transaction systems, and presents and verifies an algorithm providing this property. Hybrid atomicity is a modular property; it allows the correctness of a system to be deduced from the fact that each object is implemented to have the property. It allows more concurrency than dynamic atomicity, by assigning timestamps to transactions at commit. The Avalon system provides exactly this facility.
منابع مشابه
A concurrency control protocol for nested transactions
Nested transactions[6, 5] provide fine grain atomicity, efficient recovery control, and structural modularity. In distributed environments, they provide a natural and semantically clean way of modelin g computations . However, the characteristics of nested transactions are sufficiently different from those o f traditional single-level transactions that concurrency control for nested transaction...
متن کاملA Theory of Timestamp-Based Concurrency Control for Nested Transactions
We present a rigorous framework for analyzing timestampbased concurrency control and recovery algorithms for nested transactions. We define a local correctness property, local static atomic@, that affords useful modularity. We show that local static atomicity of each object is sufficient to ensure global serializability. We present generalizations of algorithms due to Reed and Herlihy, and show...
متن کاملArchitectural and compiler support for strongly atomic transactional memory
Transactions are gaining ground as a programmer-friendly means of expressing concurrency, as microarchitecture trends make it clear that parallel systems are in our future. This thesis presents the design and implementation of four e cient and powerful transaction systems: ApeX, an objectoriented software-only system; UTM and LTM, two scalable systems using custom processor extensions; and HyAp...
متن کاملCommutativity-Based Locking for Nested Transactions
We present a new model for describing and reasoning about transaction-processing algorithms. The model provides a comprehensive, uniform framework for rigorous correctness proofs. The model generalizes previous work on concurrency control to encompass nested transactions and type-specific concurrency control algorithms. Using our model, we describe general conditions for a concurrency control a...
متن کاملSolving Difficult HTM Problems Without Difficult Hardware
There are several classes of operations, including I/O and memory allocation, that are considered difficult to perform as part of a transaction. To allow such operations inside of transactions, previous hardware transactional memory systems have proposed additional mechanisms such as opennested transactions that use hardware management of software handlers. Open-nested transactions are not nece...
متن کامل